Limit points for average genus II. 2-Connected non-simplicial graphs
نویسندگان
چکیده
منابع مشابه
Limit points for average genus II. 2-Connected non-simplicial graphs
In part (I) of this paper, it is proved that there are no limit points for the set of values of average genus of 2-connected simplicial graphs and of 3-connected graphs. The need for such restrictions is now demonstrated by showing that innnitely many real numbers are limit points of values of average genus for 2-connected non-simplicial graphs. A systematic method for constructing such limit p...
متن کاملLimit points for average genus. I. 3-Connected and 2-connected simplicial graphs
It is demonstrated that a given value of average genus is shared by at most nitely many 2-connected simplicial graphs and by at most nitely many 3-connected graphs. Moreover, the distribution of values of average genus is sparse, in the following sense: within any nite real interval, there are at most nitely many different numbers that are values of average genus for 2-connected simplicial grap...
متن کاملGenerating connected and 2-edge connected graphs
We focus on the algorithm underlying the main result of [6]. This is an algebraic formula to generate all connected graphs in a recursive and efficient manner. The key feature is that each graph carries a scalar factor given by the inverse of the order of its group of automorphisms. In the present paper, we revise that algorithm on the level of graphs. Moreover, we extend the result subsequentl...
متن کاملAsymptotic enumeration and limit laws for graphs of fixed genus
It is shown that the number of labelled graphs with n vertices that can be embedded in the orientable surface Sg of genus g grows asymptotically like cnγn! where c > 0, and γ ≈ 27.23 is the exponential growth rate of planar graphs. This generalizes the result for the planar case g = 0, obtained by Giménez and Noy. An analogous result for non-orientable surfaces is obtained. In addition, it is p...
متن کامل2-connected Graphs with Small 2-connected Dominating Sets
Let G be a 2-connected graph. A subset D of V (G) is a 2-connected dominating set if every vertex of G has a neighbor in D and D induces a 2-connected subgraph. Let γ2(G) denote the minimum size of a 2-connected dominating set of G. Let δ(G) be the minimum degree of G. For an n-vertex graph G, we prove that γ2(G) ≤ n ln δ(G) δ(G) (1 + oδ(1)) where oδ(1) denotes a function that tends to 0 as δ →...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1992
ISSN: 0095-8956
DOI: 10.1016/0095-8956(92)90011-l